External Memory Orthogonal Range Reporting with Fast Updates
نویسنده
چکیده
In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.
منابع مشابه
Amortized Bounds for Dynamic Orthogonal Range Reporting
We consider the fundamental problem of 2-D dynamic orthogonal range reporting for 2and 3-sided queries in the standard word RAM model. While many previous dynamic data structures use O(log n/ log log n) update time, we achieve faster O(log n) and O(log n) update times for 2and 3-sided queries, respectively. Our data structures have optimalO(log n/ log log n) query time. Only Mortensen [13] had ...
متن کاملDynamic Data Structures: Orthogonal Range Queries and Update Efficiency
English) We study dynamic data structures for different variants of orthogonal range reporting query problems. In particular, we consider (1) the planar orthogonal 3-sided range reporting problem: given a set of points in the plane, report the points that lie within a given 3-sided rectangle with one unbounded side, (2) the planar orthogonal range maxima reporting problem: given a set of points...
متن کاملExternal Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates
An external memory data structure is presented for maintaining a dynamic set ofN two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the k points with highest y-value within a given x-range. For any constant 0 < ε ≤ 1 2 , a data structure is constructed that supports updates in a...
متن کاملOptimal Color Range Reporting in One Dimension
Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a color. While the answer to an orthogonal point reporting query contains all points in the query range Q, the answer to a color reporting query contains only distinct colors of points in Q. In this paper we describe an O(N)-space data structure that answer...
متن کاملI/O-Efficient Top-k Range Reporting with Logarithmic Update Cost∗
In the top-k range reporting problem, the input set S consists of n points in the real domain, each of which is associated with a distinct real-valued score. Given an interval q = [x1, x2] and an integer k ∈ [1, n], a query returns the k points in q having the largest scores. Specially, if q covers less than k points of S, all of them are returned. We want to store S in a dynamic structure so t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011